Enriching Solutions to Combinatorial Problems via Solution Engineering

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Molecular computation of solutions to combinatorial problems.

The tools of molecular biology were used to solve an instance of the directed Hamiltonian path problem. A small graph was encoded in molecules of DNA, and the "operations" of the computation were performed with standard protocols and enzymes. This experiment demonstrates the feasibility of carrying out computations at the molecular level.

متن کامل

Enriching a lexicographic tool with domain definitions: Problems and solutions

Enriching linguistic resources with domain information has been considered one important target in natural language applications. However, automatic definition extraction of this domain information from specialized resources has revealed certain methodological problems in definition construction. This paper presents some problems encountered in automatic definition extraction that are mainly re...

متن کامل

Linear Complementarity as a General Solution Method to Combinatorial Problems

T paper shows how many types of combinatorial problems can be embedded in continuous space and solved as nonconvex optimization problems. If the objective function and the constraints are linear, problems of this kind can be formulated as linear complementarity problems. An algorithm is presented to solve this type of problem and indicate its convergence properties. Computational comparisons ar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: INFORMS Journal on Computing

سال: 2019

ISSN: 1091-9856,1526-5528

DOI: 10.1287/ijoc.2018.0855